منابع مشابه
Deformation of Gabor Systems
We introduce a new notion for the deformation of Gabor systems. Such deformations are in general nonlinear and, in particular, include the standard jitter error and linear deformations of phase space. With this new notion we prove a strong deformation result for Gabor frames and Gabor Riesz sequences that covers the known perturbation and deformation results. Our proof of the deformation theore...
متن کاملCompleteness of Combinations of Constructor Systems
A term rewriting system is called complete if it is both confluent and strongly normalising. Barendregt and Klop showed that the disjoint union of complete term rewriting systems does not need to be complete. In other words, completeness is not a modular property of term rewriting systems. Toyama, Klop and Barendregt showed that completeness is a modular property of left-linear term rewriting s...
متن کاملCompleteness of Combinations of Conditional Constructor Systems
A property of term rewriting systems is modular if it is preserved under disjoint union. In the past few years the modularity of properties of term rewriting systems has been extensively studied. The first results in this direction were obtained by Toyama. In (Toyama, 1987a) he showed that confluence is a modular property (see Klop et al. (1994) for a simplified proof) and in (Toyama, 1987b) he...
متن کاملTuring-Completeness of Polymorphic Stream Equation Systems
Polymorphic stream functions operate on the structure of streams, infinite sequences of elements, without inspection of the contained data, having to work on all streams over all signatures uniformly. A natural, yet restrictive class of polymorphic stream functions comprises those definable by a system of equations using only stream constructors and destructors and recursive calls. Using method...
متن کاملOn the Completeness of Modular Proof Systems
This paper is concerned with the design of sound and complete proof systems for programming languages. Originated by [5], proof systems are designed to verify correctness of programs by means of formal deductions. A proof system is an axiomatic system in which properties of programs, expressed as logical formulae, can be deduced formally. A compositional proof system is a syntax-directed proof ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Approximation Theory
سال: 2016
ISSN: 0021-9045
DOI: 10.1016/j.jat.2016.03.001